Crowdshipping: An open VRP variant with stochastic destinations

نویسندگان

چکیده

E-commerce continues to grow throughout the world due people’s preference stay at home rather than going a brick-and-mortar retail store. COVID-19 has exacerbated this trend. Concurrently, crowd-shipping been gaining in popularity both increase e-commerce and current pressures COVID-19. We consider setting where platform can fulfill heterogeneous delivery requests from central depot with fleet of professionally driven vehicles pool capacitated occasional drivers. divide into sectors represent different neighborhoods city. Occasional drivers have unknown destinations that be anywhere inside sectors. Route duration constraints are modeled motivate participation probability route-acceptance by keeping routes short. assume will choose better compensated is dependent on other being offered. propose two-stage stochastic model formulate problem. use branch-and-price algorithm capable solving 50-customer instances, develop heuristic solve larger 100-customer instances quickly. An upper bound for total number used reduce master problem complexity pricing problems. show far cost over 30%, while near 20%. route capacity restrict driver need simultaneously order reductions. This viable option last-mile deliveries.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Approximation Algorithms for VRP with Stochastic Demands

We consider the vehicle routing problem with stochastic demands (VRPSD). We give randomized approximation algorithms achieving approximation guarantees of 1 + for split-delivery VRPSD, and 2 + for unsplit-delivery VRPSD; here  is the best approximation guarantee for the traveling salesman problem. These bounds match the best known for even the respective deterministic problems [Altinkemer, K...

متن کامل

An Interactive Distributed Approach for the Vrp with Time Windows

The Vehicle Routing Problem with Time Windows (VRPTW) is a hard combinatorial problem that has received a lot of attention in Operations Research and Artificial Intelligence literature. This interest is due, on one hand to, its wide applicability in real-world cases and practical settings, and on the other hand to its NP-hard aspect. Several models and solving methods, essentially centralised, ...

متن کامل

The Static and Stochastic VRP with Time Windows and both Random Customers and Reveal Times

Static and stochastic vehicle routing problems (SS-VRP) aim at modeling and solving real life problems by considering uncertainty on the data. In particular, customer data may not be known with certainty. Before the beginning of the day, probability distributions on customer data are used to compute a firststage solution that optimizes an expected cost. Customer data are revealed online, while ...

متن کامل

Stochastic Motion of an Open Bosonic String

We show that the classical stochastic motion of an open bosonic string leads to the same results as the standard first quantization of this system. For this, the diffusion constant governing the process has to be proportional to α, the Regge slope parameter, which is the only constant, along with the velocity of light, needed to describe the motion of a string. 11.25.-w, 02.50.Ey Typeset using ...

متن کامل

Stochastic models for an open biochemical system.

This paper uses the theory of Markov processes to derive stochastic models for a single open biochemical system at steady state under 3 sets of assumptions. The system is a one substrate, one product reaction. Each set of assumptions re:mlts in a separate solution for the probability functions. A system of linear equations in the probability function as well as an equivalent differential equati...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Transportation Research Part C-emerging Technologies

سال: 2022

ISSN: ['1879-2359', '0968-090X']

DOI: https://doi.org/10.1016/j.trc.2022.103677